A hybrid approach to multi-depot multiple traveling salesman problem based on firefly algorithm and ant colony optimization

<span>This study proposed a hybrid approach of firefly algorithm (FA) and ant colony optimization (ACO) for solving multi-depot multiple traveling salesman problem, TSP with more than one departure city. The FA is fast converging but easily trapped into the local optimum. ACO has great ability to search solution it converges slowly. To get better result convergence time, we integrate find solutions global solution. are normalized then initialized quantity pheromones running ACO. Furthermore, experimented best parameters in order optimize In justification, used sea transportation route Indonesia as case study. experimental results showed that superior performance an average computational time 26.90% 32.75% faster ACO.</span>